Estimating the Gowers Norm of Modulo Functions over Prime Fields
نویسندگان
چکیده
منابع مشابه
Structure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملNorm-euclidean Cyclic Fields of Prime Degree
Let K be a cyclic number field of prime degree `. Heilbronn showed that for a given ` there are only finitely many such fields that are normEuclidean. In the case of ` = 2 all such norm-Euclidean fields have been identified, but for ` 6= 2, little else is known. We give the first upper bounds on the discriminants of such fields when ` > 2. Our methods lead to a simple algorithm which allows one...
متن کاملThe Inverse Conjecture for the Gowers Norm over Finite Fields via the Correspondence Principle Terence Tao and Tamar Ziegler
The inverse conjecture for the Gowers norms U(V ) for finite-dimensional vector spaces V over a finite field F asserts, roughly speaking, that a bounded function f has large Gowers norm ‖f‖Ud(V ) if and only if it correlates with a phase polynomial φ = eF(P ) of degree at most d− 1, thus P : V → F is a polynomial of degree at most d− 1. In this paper, we develop a variant of the Furstenberg cor...
متن کاملLinear Forms from the Gowers Uniformity Norm
The application we have in mind is ν = p1S where S ⊆ ZN satisfies S ⊆ ZN and p = |S| /N . We do not give all the details in this note and we also assume familiarity with [1]. We sketch how to modify the argument in [1] to show the result under the assumption (1). As noted in Footnote 5 on page 16 of [1], the only hypotheses needed for the proof of the counting lemma are the strong linear forms ...
متن کاملSolvability of norm equations over cyclic number fields of prime degree
Let L = Q[α] be an abelian number field of prime degree q, and let a be a nonzero rational number. We describe an algorithm which takes as input a and the minimal polynomial of α over Q, and determines if a is a norm of an element of L. We show that, if we ignore the time needed to obtain a complete factorization of a and a complete factorization of the discriminant of α, then the algorithm run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.755